Solving hard problems by easy methods: Differential and integral quadrature
نویسندگان
چکیده
منابع مشابه
Easy Problems are Sometimes Hard
We present a detailed experimental investigation of the easy-hard-easy phase transition for randomly generated instances of satisfiability problems. Problems in the hard part of the phase transition have been extensively used for benchmarking satisfiability algorithms. This study demonstrates that problem classes and regions of the phase transition previously thought to be easy can sometimes be...
متن کاملFree Vibration of Annular Plates by Discrete Singular Convolution and Differential Quadrature Methods
Plates and shells are significant structural components in many engineering and industrial applications. In this study, the free vibration analysis of annular plates is investigated. To this aim, two different numerical methods including the differential quadrature and the discrete singular convolution methods are performedfor numerical simulations. Moreover, the Frequency values are obtained v...
متن کاملHard and Easy Distributions of SAT Problems
We report results from large-scale experiments in satis-ability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satissability testing is quite diicult....
متن کاملSolving Hard Coreference Problems
Coreference resolution is a key problem in natural language understanding that still escapes reliable solutions. One fundamental difficulty has been that of resolving instances involving pronouns since they often require deep language understanding and use of background knowledge. In this paper we propose an algorithmic solution that involves a new representation for the knowledge required to a...
متن کاملTowards Hybrid Methods for Solving Hard Combinatorial Optimization Problems
Combinatorial Optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory that sits at the intersection of many fields, such as artificial intelligence,mathematics and software engineering. Combinatorial optimization problems commonly imply finding values to a set of variables which ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1975
ISSN: 0898-1221
DOI: 10.1016/0898-1221(75)90013-9